منابع مشابه
A Note on a Communication Game
We describe a communication game, and a conjecture about this game, whose proof would imply the well-known Sensitivity Conjecture asserting a polynomial relation between sensitivity and block sensitivity for Boolean functions. The author defined this game and observed the connection in Dec. 2013 Jan. 2014. The game and connection were independently discovered by Gilmer, Koucký, and Saks, who al...
متن کاملCellular Networks, Satellite Communication 1 Satellite Communication
A satellite communications system is based on antennas in a stable orbit above the earth. Satellites serve as relay stations in the sky. The basic idea of satellite communications is that two stations on earth discuss via one or more satellites. So a little bit of satellite-related terminology: 1. Earth station is an antenna on or near the surface of the earth. 2. Uplink is a transmission from ...
متن کاملA note on optimal communication spanning trees
The optimal communication spanning tree (OCT) problem is defined as follows. Let G = (V, E, w) be an undirected graph with nonnegative edge length function w. We are also given the requirements λ(u, v) for each pair of vertices. For any spanning tree T of G, the communication cost between two vertices is defined to be the requirement multiplied by the path length of the two vertices on T , and ...
متن کاملA note on a value with incomplete communication
The Myerson’s models on partial cooperation have been studied extensively [SIAM J. Discrete Math. 5 (1992) 305; Math. Methods Operations Res. 2 (1977) 225; Int. J. Game Theory 19 (1980) 421; 20 (1992) 255]. In [Game Econ. Behav. 26 (1999) 565], Hamiache proposes a new solution concept for communication situations. In this work, we analyze this value making some deficiencies clear and generalize...
متن کاملA note on a problem in communication complexity
In this note, we prove a version of Tarui’s Theorem in communication complexity, namely PHcc ⊆ BP · PPcc. Consequently, every measure for PPcc leads to a measure for PHcc, subsuming a result of Linial and Shraibman that problems with high mc-rigidity lie outside the polynomial hierarchy. By slightly changing the definition of mc-rigidity (arbitrary instead of uniform distribution), it is then e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1990
ISSN: 0024-3795
DOI: 10.1016/0024-3795(90)90116-t